A distance-regular graph with bipartite geodetically closed subgraphs
نویسندگان
چکیده
منابع مشابه
A distance-regular graph with bipartite geodetically closed subgraphs
Let Γ be a distance-regular graph of diameter d , and t be an integer with 2 ≤ t ≤ d − 1 such that at−1 = 0. For any pair (u, v) of vertices, let Π (u, v) be the subgraph induced by the vertices lying on shortest paths between u and v. We prove that if Π (u, v) is a bipartite geodetically closed subgraph for some pair (u, v) of vertices at distance t , then Π (x, y) is a bipartite geodetically ...
متن کاملWeak-Geodetically Closed Subgraphs in Distance-Regular Graphs
We show that if the intersection number c2 > 1 then any weak-geodetically closed subgraph of X is distance-regular. Γ is said to be i-bounded, whenever for all x, y ∈ X at distance δ(x, y) ≤ i, x, y are contained in a common weakgeodetically closed subgraph of Γ of diameter δ(x, y). By a parallelogram of length i, we mean a 4-tuple xyzw of vertices in X such that δ(x, y) = δ(z, w) = 1, δ(x,w) =...
متن کاملA Distance-Regular Graph with Strongly Closed Subgraphs
Let be a distance-regular graph of diameter d, valency k and r := max{i | (ci , bi ) = (c1, b1)}. Let q be an integer with r + 1 ≤ q ≤ d − 1. In this paper we prove the following results: Theorem 1 Suppose for any pair of vertices at distance q there exists a strongly closed subgraph of diameter q containing them. Then for any integer i with 1 ≤ i ≤ q and for any pair of vertices at distance i ...
متن کاملSubgraphs Graph in a Distance-regular Graph
Let Γ denote a D-bounded distance-regular graph, where D ≥ 3 is the diameter of Γ. For 0 ≤ s ≤ D − 3 and a weak-geodetically closed subgraph ∆ of Γ with diameter s, define a graph G(∆) whose vertex set is the collection of all weak-geodetically closed subgraphs of diameter s+2 containing ∆, and vertex Ω is adjacent to vertex Ω′ in G if and only if Ω∩Ω′ as a subgraph of Γ has diameter s+1. We sh...
متن کاملThe local eigenvalues of a bipartite distance-regular graph
We consider a bipartite distance-regular graph Γ with vertex set X, diameter D ≥ 4, and valency k ≥ 3. For 0 ≤ i ≤ D, let Γ i (x) denote the set of vertices in X that are distance i from vertex x. We assume there exist scalars r, s, t ∈, not all zero, such that r|Γ 1 (x) ∩ Γ 1 (y) ∩ Γ 2 (z)| + s|Γ 2 (x) ∩ Γ 2 (y) ∩ Γ 1 (z)| + t = 0 let Γ 2 2 denote the graph with vertex set˜X = {y ∈ X | ∂(x, y)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2003
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(03)00014-3